#include "binarysearchtree.h"

int main()
{
	BSTree<int> bst;
	int arr[] = { 5,7,8,6,2,3,4 ,0};
	for (auto x : arr)
	{
		bst.insert(x);
	}
	bst.InOrder();
	for (auto x : arr)
	{
		bst.erase(x);
		bst.InOrder();
	}
	return 0;
}